Numerical Solution of Large Nonsymmetric Eigenvalue Problems

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical methods for large eigenvalue problems

Over the past decade considerable progress has been made towards the numerical solution of large-scale eigenvalue problems, particularly for nonsymmetric matrices. Krylov methods and variants of subspace iteration have been improved to the point that problems of the order of several million variables can be solved. The methods and software that have led to these advances are surveyed.

متن کامل

A Test Matrix Collection for Non-Hermitian Eigenvalue Problems

The primary purpose of this collection is to provide a testbed for the development of numerical algorithms for solving nonsymmetric eigenvalue problems. In addition, as with many other existing collections of test matrices, our goal includes providing an easy access to \practical" eigenproblems for researchers, educators and students in the community who are interested in the origins of large s...

متن کامل

Implicitly Restarted Arnoldi/lanczos Methods for Large Scale Eigenvalue Calculations

This report provides an introductory overview of the numerical solution of large scale algebraic eigenvalue problems. The main focus is on a class of methods called Krylov subspace projection methods. The Lanczos method is the premier member of this class and the Arnoldi method is a generalization to the nonsymmetric case. A recently developed and very promising variant of the Arnoldi/Lanczos s...

متن کامل

Progress in the numerical solution of the nonsymmetric eigenvalue problem

Having worked several years on the LAPACK project [2] and having communicated with a variety of users who work in diverse fields involving scientific computing, the author has seen a growing demand for the numerical solution of the eigenvalue problems. Since the publication of Parlett’s exploratory review paper, ‘The software scene in the extraction of eigenvalues from sparse matrices’ [35], ne...

متن کامل

Preconditioned Jacobi-Davidson Algorithm for Nonsymmetric, Complex Eigenvalue Problems arising with Gyrotropic Materials in Resonator Cavities

For the numerical solution of complex eigenvalue problems, arising with gyrotropic materials in resonators, the Jacobi-Davidson method is considered. In this paper the correction equation, which has to be solved within the Jacobi-Davidson method, is simplified and several preconditioning strategies, including also a multigrid scheme, are compared for the approximate solution of this correction ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989